Computational complexity of the average covering tree value
نویسندگان
چکیده
In this paper we prove that calculating the average covering tree value recently proposed as a single-valued solution of graph games is #P-complete.
منابع مشابه
Computational Complexity of the Average Covering Tree Value by Ayumi IGARASHI and Yoshitsugu YAMAMOTO November 2012 UNIVERSITY OF TSUKUBA Tsukuba , Ibaraki 305 - 8573 JAPAN
In this paper we prove that calculating the average covering tree value recently proposed as a single-valued solution of graph games is #P-complete.
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملThe average covering tree value for directed graph games
We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on th...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کامل